$k$-to-$1$ functions on an arc
نویسندگان
چکیده
منابع مشابه
Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs
The graphs we shall consider are topological graphs that is they lie in R3 and each edge is homeomorphic to [0, 1]. If a graph is simple, that is it has no loops or multiple edges, then each edge may be taken to be a straight line joining the two vertices at the ends of the edge. A function is k-to-1 if each point in the codomain has precisely k preimages in the domain. Given two graphs G and H...
متن کاملOn 1-Arc-regular Graphs
A graph is 1-arc-regular if its full automorphism group acts regularly on the set of its arcs. In this paper, we investigate 1-arc-regular graphs of prime valency, especially of valency 3. First, we prove that if G is a soluble group then a (G, 1)-arc-regular graph must be a Cayley graph of a subgroup of G . Next we consider trivalent Cayley graphs of a finite nonabelian simple group and obtain...
متن کاملPolarization constant $mathcal{K}(n,X)=1$ for entire functions of exponential type
In this paper we will prove that if $L$ is a continuous symmetric n-linear form on a Hilbert space and $widehat{L}$ is the associated continuous n-homogeneous polynomial, then $||L||=||widehat{L}||$. For the proof we are using a classical generalized inequality due to S. Bernstein for entire functions of exponential type. Furthermore we study the case that if X is a Banach space then we have t...
متن کاملSmooth functions on C(K)
Natural examples of spaces satisfying (i) or (ii) are c0 and the original Tsirelson space, and Bates asked whether indeed c0 / ∈ B. The question was settled in [9] (i.e. c0 / ∈ B), a paper which was conducted without any knowledge of S. Bates’ work, and which was mainly concerned with the behavior of C-smooth real functions on c0. In order to reveal the connection between these matters, let us ...
متن کاملSpanning k-arc-strong subdigraphs with few arcs in k-arc-strong tournaments
Given a k-arc-strong tournament T , we estimate the minimum number of arcs possible in a k-arc-strong spanning subdigraph of T . We give a construction which shows that for each k ≥ 2 there are tournaments T on n vertices such that every k-arc-strong spanning subdigraph of T contains at least nk+ k(k−1) 2 arcs. In fact, the tournaments in our construction have the property that every spanning s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1987
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1987-0911022-x